Perfect codes as isomorphic spaces
نویسندگان
چکیده
منابع مشابه
Intersection of Isomorphic Linear Codes
Given an (n, k) linear code C over GF(q), the intersection of C with a code ?(C), where ? # Sn , is an (n, k1) code, where max[0, 2k&n] k1 k. The intersection problem is to determine which integers in this range are attainable for a given code C. We show that, depending on the structure of the generator matrix of the code, some of the values in this range are attainable. As a consequence we giv...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملNo More Perfect Codes: Classification of Perfect Quantum Codes
We solve the problem of the classification of perfect quantum codes. We prove that the only nontrivial perfect quantum codes are those with the parameters ( ( 2 2 2 ( 1) ( 1) , ,3 l n q q q q − − − )) l . There exist no other nontrivial perfect quantum codes.
متن کاملCodes as Fractals and Noncommutative Spaces
We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can associate geometric spaces constructed using methods from noncommutative geometry, arising from rational noncommutative tori and finite abelian group actions on Cuntz algebras and fractals associated to the clas...
متن کاملZ4-Linear Perfect Codes
For every n = 2 k ≥ 16 there exist exactly ⌊(k + 1)/2⌋ mutually nonequiv-alent Z 4-linear extended perfect codes with distance 4. All these codes have different ranks. Codes represented in such a manner are called Z 4-linear. In [5] it is shown that the extended Golay code and the extended Hamming (n, 2 n−log 2 n−1 , 4)-codes (of length n and cardinality 2 n−log 2 n−1 , with distance 4) for eve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.03.039